Optimal Epidemic Information Dissemination in Uncertain Dynamic Environment
نویسندگان
چکیده
منابع مشابه
Optimal epidemic dissemination
We consider the problem of reliable epidemic dissemination of a rumor in a fully connected network of n processes using push and pull operations. We revisit the random phone call model and show that it is possible to disseminate a rumor to all processes with high probability using Θ(lnn) rounds of communication and only n+o(n)messages of size b, all of which are asymptotically optimal and achie...
متن کاملAgreement in Epidemic Information Dissemination
Consensus is one of the fundamental problems in multi-agent systems and distributed computing, in which agents or processing nodes are required to reach global agreement on some data value, decision, action, or synchronisation. In the absence of centralised coordination, achieving global consensus is challenging especially in dynamic and large-scale distributed systems with faulty processes. Th...
متن کاملEpidemic Dissemination of Presence Information in Mobile Instant Messaging Systems
This paper presents an approach for exchanging presence information between users of an instant messaging system in a mobile ad hoc network. As major feature, presence information is transferred when mobile users get in direct contact, similar to the spread of an infections disease. By exploiting node mobility, presence information is epidemically distributed throughout the network, effectively...
متن کاملAGE REPLACEMENT POLICY IN UNCERTAIN ENVIRONMENT
Age replacement policy is concerned with finding an optional time tominimize the cost, at which time the unit is replaced even if itdoes not fail. So far, age replacement policy involving random agehas been proposed. This paper will assume the age of the unit is anuncertain variable, and find the optimal time to replace the unit.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Wireless Communications Letters
سال: 2018
ISSN: 2162-2337,2162-2345
DOI: 10.1109/lwc.2018.2792023